Periodic scheduling of marked graphs using balanced binary words
نویسندگان
چکیده
منابع مشابه
Periodic scheduling of marked graphs using balanced binary words
This paper presents an algorithm to statically schedule live and strongly connected Marked Graphs (MG). The proposed algorithm computes the best execution where the execution rate is maximal and place sizes are minimal. The proposed algorithm provides transition schedules represented as binary words. These words are chosen to be balanced. The contributions of this paper is the proposed algorith...
متن کاملPeriodic balanced binary triangles
A binary triangle of size n is a triangle of zeroes and ones, with n rows, built with the same local rule as the standard Pascal triangle modulo 2. A binary triangle is said to be balanced if the absolute difference between the numbers of zeroes and ones that constitute this triangle is at most 1. In this paper, the existence of balanced binary triangles of size n, for all positive integers n, ...
متن کاملBinary Morphisms to Ultimately Periodic Words
This paper classifies morphisms from {0, 1} that map to ultimately periodic words. In particular, if a morphism h maps an infinite non-ultimately periodic word to an ultimately periodic word then it must be true that h(0) commutes with h(1).
متن کاملBinary Equality Words for Periodic Morphisms
Let g and h be binary morphisms defined on {a, b}∗, and let g be periodic and h nonperiodic. It is well known that their equality language is generated by at most one nonempty word. Suppose |h(b)| ≥ |h(a)|. We show that then the equality word is equal to aba , with i, j ≥ 0. Binary equality sets are the simplest nontrivial equality languages. Nevertheless, their full description is still not kn...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.08.012